youtube
Learn discrete mathematics in this beginner's course. Discrete mathematics plays a key role in IT solutions, used in machine learning, accelerating queries in search engines and databases, in algorithms such as finding the shortest paths (graph theory), encryption, compression, and many other modern systems/solutions.
This field is constantly evolving along with the development of its key application: computer science. This course is an introduction to this group of mathematical sciences, and we will focus on the most important issues on which other branches of discrete mathematics are based: combinatorics, number theory, prime numbers, and several selected topics: pigeonhole principle, stars and bars principle, Stirling's number, and the Chinese remainder theorem. At the end of the course, there are tips and encouragement for further exploration of this field.
Karol Kurek teaches this course. He is a former math teacher and senior Python developer.
🔗 Course resources:
Contact:
YT Channel:
Support:
⭐️ Contents ⭐️
- 00:00:00 Introduction to Discrete Mathematics
- 00:05:20 Permutations: Definition and Examples
- 00:08:27 Applications of Permutations
- 00:10:14 Cycles and Multiset Permutations
- 00:13:13 Counting Permutations: The Formulas
- 00:19:12 Permutations in Python with itertools
- 00:25:18 Custom Python Function for Counting Permutations
- 00:33:23 Heap's Algorithm
- 00:40:59 K-Permutations and K-Tuples
- 00:46:08 The Rule of Product
- 00:53:35 The Ru
|
2025/11/13
youtube
![Harvard CS50 prof David J. Malan on why you should learn programming slowly [Podcast #197]](https://i.ytimg.com/vi/ZK6XWSCCgPQ/sddefault.jpg)
